Effective method for coding and decoding RS codes using SIMD instructions

نویسنده

  • Aleksei Marov
چکیده

a method is introduced for efficient encoding and decoding of the Reed-Solomon codes based on the matrix formalism. In this ideology, a method is suggested for vectorization of the Berlekamp-Massey algorithm for detecting and correcting several silent data corruptions. The results of comparison of suggested method with other knows ways of decoding RS codes are presented. This approach requires small amount of additional memory for intermediate computations, can be implemented with the high speed libraries performed Galois field arithmetic, and shows promising prospects for parallelization. Keywords—Reed-Solomon codes, silent data corruption, Berlekamp-Massey algorithm, SIMD instructions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

تجزیه و تحلیل عملکرد کدهای کانولوشنال تعریف شده در میدان حقیقی در کانال فیدینگ و در حضور نویز کوانتیزاسیون

Channel coding is one of the techniques used for suppression of fading and channel noise effects. Most of the researches on channel codes have been focused on the codes which are defined on Galois fields. Since two decades ago, using channel codes defined on Real and Complex fields has been considered for joint sourcechannel coding in multimedia transmission; but most of the works have focused ...

متن کامل

Iterative Multivariate Interpolation for Low Complexity Reed - Solomon Codes

The algebraic soft-decoding (ASD) of Reed– Solomon (RS) codes provides significant coding gain over hard-decision decoding with polynomial complexity. In order to reduce the complexity in this paper, high-throughput interpolator architecture for soft-decision decoding of Reed– Solomon (RS) codes based on low-complexity chase (LCC) decoding is presented. An efficiency is low, in terms of areadel...

متن کامل

Decoding Shortened Reed Solomon Codes at Bit Level

This study presents a novel means of shortening a Reed Solomon (RS) code at the bit level, yielding only shortened BCH subcodes. With the use of a certain basis, an RS codes over ) 2 ( m GF is mapped onto a binary image[4], which contains m concatenated BCH sub-codewords and some glue-vector codewords. With the proposed approach, there only exist some shortened BCH subcode generators in the dia...

متن کامل

Performance of Reed-Solomon codes using the Guruswami-Sudan algorithm with improved interpolation efficiency

List decoding is a novel method for decoding Reed–Solomon (RS) codes that generates a list of candidate transmitted messages instead of one unique message as with conventional algebraic decoding, making it possible to correct more errors. The Guruswami–Sudan (GS) algorithm is the most efficient list decoding algorithm for RS codes. Until recently only a few papers in the literature suggested pr...

متن کامل

Soft Decision Decoding of Rs Codes under Higher Data Rate

Two new iterative soft decision decoding methods for Reed-Solomon (RS) codes are proposed. These methods are based on bit level belief propagation (BP) decoding. In order to make BP decoding effective for RS codes, we use an extended binary parity check matrix with a lower density and reduced number of 4-cycles compared to the original binary parity check matrix of the code. In the first propos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014